منابع مشابه
the life story of the twelve imams (a.s.) in jāmī’s shawāhid al-nabuwwa
shawāhid al-nabuwwa of ‘abd al-raḥmān jāmī (d. 898/1492) is among the books written by one of the sunnī scholars who has authored it with a sufi taste. in this book, jāmī has addressed the life of the prophet (s.a.w.), the twelve imams (a.s.), and the companions (ṣaḥāba) with a miracle-oriented approach and has presented precisely the same reports about the imams (a.s.) that are found in shī‘ī ...
متن کاملghuluv, in the Age of Imams (a)
Research on the roots and causes of dangerous phenomenon of exaggeration, ghuluv, mainly appeared as overstating Shiite Imams, is of considerable important. Needless to say, exact acquaintance to the roots and causes of exaggeration, in many cases, would support people against this danger. Relying on precedent historical, traditional, sectarian documents and noting to different views in the fie...
متن کاملThe role of imams and mosques in health promotion in Western societies—a systematic review protocol
BACKGROUND Muslims comprise 4.8% of the national population in the UK and also form a significant proportion of its ethnic minority population, with trends set to continue for the foreseeable future. With ethnic minority health inequalities deepening further, there is an apparent lack of strategies to effectively tackle this growing problem. Imams, Muslim religious leaders, represent a hitherto...
متن کاملTwelve Publications
We prove a complexity classification theorem that classifies all counting constraint satisfaction problems (#CSP) over Boolean variables into exactly three categories: (1) Polynomial-time tractable; (2) #P-hard for general instances, but solvable in polynomial-time over planar graphs; and (3) #P-hard over planar graphs. The classification applies to all sets of local, not necessarily symmetric,...
متن کاملTwelve Problems in Proof Complexity
Proof complexity is a research area that studies the concept of complexity from the point of view of logic. Although it is very much connected with computational complexity, the goals are different. In proof complexity we are studying the question how difficult is to prove a theorem? There are various ways how one can measure the “complexity” of a theorem. We may ask what is the length of the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Turkish Studies
سال: 2010
ISSN: 1308-2140
DOI: 10.7827/turkishstudies.1160